MINIMAL NON-INTEGER ALPHABETS ALLOWING PARALLEL ADDITION
نویسندگان
چکیده
منابع مشابه
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets
The directed acyclic word graph (DAWG) of a string y is the smallest (partial) DFA which recognizes all suffixes of y and has only O(n) nodes and edges. We present the first O(n)-time algorithm for computing the DAWG of a given string y of length n over an integer alphabet of polynomial size in n. We also show that a straightforward modification to our DAWG construction algorithm leads to the f...
متن کاملSuux Trees for Integer Alphabets Revisited
Farach recently gave a linear-time algorithm for constructing suux trees for integer alphabets, which solves a major open problem on index data structures. We present a new and somewhat cleaner algorithm for constructing suux trees for integer alphabets in linear time.
متن کاملMinimal Digit Sets for Parallel Addition in Non-Standard Numeration Systems
We study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base β in C and a finite digit set A of contiguous integers containing 0. For a fixed base β, we focus on the question of the size of the alphabet that permits addition in constant time, independently of the length of representation of the summands. We produce lower b...
متن کاملParallel addition in non-standard numeration systems
We consider numeration systems where digits are integers and the base is an algebraic number β such that |β| > 1 and β satisfies a polynomial where one coefficient is dominant in a certain sense. For this class of bases β, we can find an alphabet of signed-digits on which addition is realizable by a parallel algorithm in constant time. This algorithm is a kind of generalization of the one of Av...
متن کاملk-Block parallel addition versus 1-block parallel addition in non-standard numeration systems
Parallel addition in integer base is used for speeding up multiplication and division algorithms. k-block parallel addition has been introduced by Kornerup in [14]: instead of manipulating single digits, one works with blocks of fixed length k. The aim of this paper is to investigate how such notion influences the relationship between the base and the cardinality of the alphabet allowing block ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Polytechnica
سال: 2018
ISSN: 1805-2363,1210-2709
DOI: 10.14311/ap.2018.58.0285